An Improved Algorithm for High-speed Floating-point Addition

نویسندگان

  • Nhon T. Quach
  • Michael J. Flynn
چکیده

This paper describes an improved, IEEE conforming oating-point addition algorithm. This algorithm has only one addition step involving the signi cand in the worst-case path, hence o ering a considerable speed advantage over the existing algorithms, which typically require two to three addition steps.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ASIC Design of Butterfly Unit Based on Non-Redundant and Redundant Algorithm

Fast Fourier Transform (FFT) processors employed with pipeline architecture consist of series of Processing Elements (PE) or Butterfly Units (BU). BU or PE of FFT performs multiplication and addition on complex numbers. This paper proposes a single BU to compute radix-2, 8 point FFT in the time domain as well as frequency domain by replacing a series of PEs. This BU comprises of fused floating ...

متن کامل

Tuning of fuzzy logic controller using an improved black hole algorithm for maximizing power capture of ocean wave energy converters

Seas and oceans are the most important sources of renewable energy in the world. The main purpose of this paper is to use an appropriate control strategy to improve the performance of point absorbers. In this scheme, considering the high uncertainty in the parameters of the power take-off system in different atmospheric conditions, a new improved black hole algorithm is introduced to tune fuzzy...

متن کامل

A Survey on Floating Point Adders

Addition is the most complex operation in a floating-point unit and can cause major delay while requiring a significant area. Over the years, the VLSI community has developed many floating-point adder algorithms aimed primarily at reducing the overall latency. An efficient design of the floating-point adder offers major area and performance improvements for FPGAs. This paper studies the impleme...

متن کامل

Analyzing Two-Term Dot Product of Multiplier Using Floating Point and Booth Multiplier

The Floating Point in two-term Dot-Product of multiplier referred as discrete design. Floating Point is a wide variety for increasing accuracy, high speed, high performance and reducing delay, area and power consumption. This application of floating point is used for algorithms of Digital Signal Processing and Graphics. Many floating point application is to reduce area, from the survey the fuse...

متن کامل

Multiply & Accumulate Unit Using RNS Algorithm & Vedic Mathematics: A Review

High speed execution of arithmetic operations and high degree of precision in real time system are of major concern in any digital signal processing (DSP). Speed of DSP depends on speed of multiplier and algorithm used. In this paper we propose Residue Number System method for fast “carry free” floating point arithmetic operations. Floating Point RNS units have obvious advantages over tradition...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1990